See oracle machine in All languages combined, or Wiktionary
{ "forms": [ { "form": "oracle machines", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "oracle machine (plural oracle machines)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ { "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "Entries with translation boxes", "parents": [], "source": "w" }, { "kind": "other", "name": "Mandarin terms with redundant transliterations", "parents": [ "Terms with redundant transliterations", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "Pages with 1 entry", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "other", "name": "Terms with Finnish translations", "parents": [], "source": "w" }, { "kind": "other", "name": "Terms with Mandarin translations", "parents": [], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Theory of computing", "orig": "en:Theory of computing", "parents": [ "Computer science", "Computing", "Sciences", "Technology", "All topics", "Fundamental" ], "source": "w" } ], "examples": [ { "ref": "1994, Roger Penrose, “Quantum theory and the brain”, in Shadows of the Mind, Oxford University Press, →ISBN, page 380:", "text": "Thus, an oracle machine (which enacts an oracle algorithm) would be like an ordinary Turing machine, except that adjoined to its ordinary computational operations would be another operation: ‘Call in the oracle and ask it whether C_q(n) stops; […]", "type": "quote" } ], "glosses": [ "In computability theory, a form of theoretical Turing machine, able to solve even undecidable decision problems in a single operation." ], "id": "en-oracle_machine-en-noun-uwKwT~1s", "links": [ [ "computing", "computing#Noun" ], [ "theory", "theory" ], [ "computability theory", "computability theory" ], [ "theoretical", "theoretical" ], [ "Turing machine", "Turing machine" ], [ "decision problem", "decision problem" ], [ "operation", "operation" ] ], "raw_glosses": [ "(computing theory) In computability theory, a form of theoretical Turing machine, able to solve even undecidable decision problems in a single operation." ], "topics": [ "computing", "computing-theory", "engineering", "mathematics", "natural-sciences", "physical-sciences", "sciences" ], "translations": [ { "code": "cmn", "lang": "Chinese Mandarin", "sense": "theoretical machine", "word": "預言機" }, { "code": "cmn", "lang": "Chinese Mandarin", "roman": "yùyánjī", "sense": "theoretical machine", "word": "预言机" }, { "code": "fi", "lang": "Finnish", "sense": "theoretical machine", "word": "oraakkelikone" } ] } ], "word": "oracle machine" }
{ "forms": [ { "form": "oracle machines", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "oracle machine (plural oracle machines)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English lemmas", "English multiword terms", "English nouns", "English terms with quotations", "Entries with translation boxes", "Mandarin terms with redundant transliterations", "Pages with 1 entry", "Pages with entries", "Terms with Finnish translations", "Terms with Mandarin translations", "en:Theory of computing" ], "examples": [ { "ref": "1994, Roger Penrose, “Quantum theory and the brain”, in Shadows of the Mind, Oxford University Press, →ISBN, page 380:", "text": "Thus, an oracle machine (which enacts an oracle algorithm) would be like an ordinary Turing machine, except that adjoined to its ordinary computational operations would be another operation: ‘Call in the oracle and ask it whether C_q(n) stops; […]", "type": "quote" } ], "glosses": [ "In computability theory, a form of theoretical Turing machine, able to solve even undecidable decision problems in a single operation." ], "links": [ [ "computing", "computing#Noun" ], [ "theory", "theory" ], [ "computability theory", "computability theory" ], [ "theoretical", "theoretical" ], [ "Turing machine", "Turing machine" ], [ "decision problem", "decision problem" ], [ "operation", "operation" ] ], "raw_glosses": [ "(computing theory) In computability theory, a form of theoretical Turing machine, able to solve even undecidable decision problems in a single operation." ], "topics": [ "computing", "computing-theory", "engineering", "mathematics", "natural-sciences", "physical-sciences", "sciences" ] } ], "translations": [ { "code": "cmn", "lang": "Chinese Mandarin", "sense": "theoretical machine", "word": "預言機" }, { "code": "cmn", "lang": "Chinese Mandarin", "roman": "yùyánjī", "sense": "theoretical machine", "word": "预言机" }, { "code": "fi", "lang": "Finnish", "sense": "theoretical machine", "word": "oraakkelikone" } ], "word": "oracle machine" }
Download raw JSONL data for oracle machine meaning in English (2.1kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.